Equivalence between frequency domain blind source separation and frequency domain adaptive null beamformers
نویسندگان
چکیده
Frequency domain Blind Source Separation (BSS) is shown to be equivalent to two sets of frequency domain adaptive microphone arrays, i.e., Adaptive Null Beamformers (ANB). The minimization of the off-diagonal components in the BSS update equation can be viewed as the minimization of the mean square error in the ANB. The unmixing matrix of the BSS and the filter coefficients of the ANB converge to the same solution in the mean square error sense if the two source signals are ideally independent. Therefore, we can conclude that the performance of the BSS is upper bounded by that of the ANB. This understanding clearly explains the poor performance of the BSS in a real room with long reverberation. The fundamental difference exists in the adaptation period when they should adapt. That is, the ANB can adapt in the presence of a jammer but the absence of a target, whereas the BSS can adapt in the presence of a target and jammer, and also in the presence of only a target.
منابع مشابه
Equivalence between Frequency Domain Blind Source Separation and Frequency Domain Adaptive Beamformers
Frequency domain Blind Source Separation (BSS) is shown to be equivalent to two sets of frequency domain adaptive microphone arrays, i.e., Adaptive Beamformers (ABF). The minimization of the off-diagonal components in the BSS update equation can be viewed as the minimization of the mean square error in the ABF. The unmixing matrix of the BSS and the filter coefficients of the ABF converge to th...
متن کاملEquivalence between Frequency Domain Blind Source Separation and Adaptive Beamforming
Frequency domain Blind Source Separation (BSS) is shown to be equivalent to two sets of Adaptive Beamformers (ABFs). The minimization of the off-diagonal components in the BSS update equation can be viewed as the minimization of the mean square error in the ABF. The unmixing matrix of the BSS and the filter coefficients of the ABF converge to the same solution in the mean square error sense if ...
متن کاملEquivalence between Frequency-Domain Blind Source Separation and Frequency-Domain Adaptive Beamforming for Convolutive Mixtures
Frequency-domain blind source separation (BSS) is shown to be equivalent to two sets of frequency-domain adaptive beamformers (ABFs) under certain conditions. The zero search of the off-diagonal components in the BSS update equation can be viewed as the minimization of the mean square error in the ABFs. The unmixing matrix of the BSS and the filter coefficients of the ABFs converge to the same ...
متن کاملFundamental Limitation of Frequency Domain Blind Source Separation for Convolved Mixture of Speech
Despite several recent proposals to achieve Blind Source Separation (BSS) for realistic acoustic signals, the separation performance is still not enough. In particular, when the length of an impulse response is long, the performance is highly limited. In this paper, we consider the reason for the poor performance of BSS in a long reverberation environment. First, we show that it is useless to b...
متن کاملThe fundamental limitation of frequency domain blind source separation for convolutive mixtures of speech
Despite several recent proposals to achieve blind source separation (BSS) for realistic acoustic signals, the separation performance is still not good enough. In particular, when the impulse responses are long, performance is highly limited. In this paper, we consider a two-input, two-output convolutive BSS problem. First, we show that it is not good to be constrained by the condition , where i...
متن کامل